An alternative proof of Lorden&s renewal inequality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternative Proof of an Extremal Entropy Inequality

This paper first focuses on deriving an alternative approach for proving an extremal entropy inequality (EEI), originally presented in [11]. The proposed approach does not rely on the channel enhancement technique, and has the advantage that it yields an explicit description of the optimal solution as opposed to the implicit approach of [11]. Compared with the proofs in [11], the proposed alter...

متن کامل

An Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators

This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...

متن کامل

An Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators

This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...

متن کامل

An information - theoretic proof of Hadamard's inequality

only linearly and not exponentially with the source block length. Since a trellis approaches a tree as the constraint length grows large, this work also suggests an alternate tree coding scheme and proof of the tree coding theorem of Jakatdar and Pearlman [6]. APPENDIX A The generalized Gallager function Edk(p) is defined in (21). In the following we prove that given RN,* > RN-*(De) for allj an...

متن کامل

An information-theoretic proof of Nash's inequality

We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power [7], can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the logarithmic Sobolev inequality, and the Nash's inequality with the sharp constant.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Probability

سال: 1986

ISSN: 0001-8678,1475-6064

DOI: 10.1017/s0001867800016256